Analysis of An Approximate Median Selection Algorithm
نویسندگان
چکیده
We present analysis of an efficient algorithm for the approximate median selection problem that has been rediscovered many times, and easy to implement. The contribution of the article is in precise characterization of the accuracy of the algorithm. We present analytical results of the performance of the algorithm, as well as experimental illustrations of its precision.∗
منابع مشابه
Approximate Incremental Dynamic Analysis Using Reduction of Ground Motion Records
Incremental dynamic analysis (IDA) requires the analysis of the non-linear response history of a structure for an ensemble of ground motions, each scaled to multiple levels of intensity and selected to cover the entire range of structural response. Recognizing that IDA of practical structures is computationally demanding, an approximate procedure based on the reduction of the number of ground m...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملAn Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with high probability, a very close estimate of the true median. The running time is linear in the length n of the input. The algorithm performs fewer than 4 3 n comparisons and 1 3 n exchanges on the average. We present an...
متن کاملA Las Vegas approximation algorithm for metric 1-median selection
Given an n-point metric space, consider the problem of finding a point with the minimum sum of distances to all points. We show that this problem has a randomized algorithm that always outputs a (2+ )-approximate solution in an expected O(n/ 2) time for each constant > 0. Inheriting Indyk’s [9] algorithm, our algorithm outputs a (1 + )-approximate 1-median in O(n/ 2) time with probability Ω(1).
متن کاملEnergy Detection of Unknown Signals over Composite multipath/shadowing Fading Channels
In this paper, the performance analysis of an energy detector is exploited over composite multipath/shadowing fading channels, which is modeled by Rayleigh-lognormal (RL) distribution. Based on an approximate channel model which was recently proposed by the author, the RL envelope probability density function (pdf) is approximated by a finite sum of weighted Rayleigh pdfs. Relying on this inter...
متن کامل